Grokking Tree Coding Patterns for Interviews
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Course Overview
Basics of Tree
Introduction to Tree
Types of Tree
BST Traversal Techniques
BST Operations
Level Order Traversal Pattern (easy)
Introduction to Level Order Traversal Pattern
Reverse Level Order Traversal (easy)
Solution: Reverse Level Order Traversal
Find Largest Value in Each Tree Row (medium)
Solution: Find Largest Value in Each Tree Row
Maximum Width of Binary Tree (medium)
Solution: Maximum Width of Binary Tree
Maximum Level Sum of a Binary Tree (medium)
Solution: Maximum Level Sum of a Binary Tree
Zigzag Traversal (medium)
Solution: Zigzag Traversal
Even Odd Tree (medium)
Solution: Even Odd Tree
N-ary Tree Level Order Traversal (hard)
Solution: N-ary Tree Level Order Traversal
Tree Depth Pattern (easy)
Introduction to Tree Depth Pattern
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Minimum Depth of a Binary Tree (easy)
Solution: Minimum Depth of a Binary Tree
Balanced Binary Tree (easy)
Solution: Balanced Binary Tree
Tree Diameter (easy)
Solution: Tree Diameter
Maximum Depth of N-ary Tree (easy)
Solution: Maximum Depth of N-ary Tree
Find maximum depth of subtree (medium)
Solution: Find maximum depth of subtree
Introduction to Root to Leaf Path Pattern
Binary Tree Paths (easy)
Solution: Binary Tree Paths
Sum of Root To Leaf Binary Numbers (easy)
Solution: Sum of Root To Leaf Binary Numbers
Insufficient Nodes in Root to Leaf Paths (medium)
Solution: Insufficient Nodes in Root to Leaf Paths
Smallest String Starting From Leaf (medium)
Solution: Smallest String Starting From Leaf
Pseudo-Palindromic Paths in a Binary Tree (medium)
Solution: Pseudo-Palindromic Paths in a Binary Tree
All Paths for a Sum (medium)
Solution: All Paths for a Sum
Sum of Path Numbers (medium)
Solution: Sum of Path Numbers
Path With Given Sequence (medium)
Solution: Path With Given Sequence
Count Paths for a Sum (medium)
Solution: Count Paths for a Sum
Introduction to Leaf Processing Pattern
Sum of Left Leaves (easy)
Solution: Sum of Left Leaves
Leaf-Similar Trees (easy)
Solution: Leaf-Similar Trees
Check if all leaves are at same level (medium)
Solution: Check if all leaves are at same level
Delete Leaves With a Given Value (medium)
Solution: Delete Leaves With a Given Value
Deepest Leaves Sum (medium)
Solution: Deepest Leaves Sum
Introduction to Tree View Pattern
Right View of a Binary Tree (medium)
Solution: Right View of a Binary Tree
Top View Of the Binary Tree (medium)
Solution: Top View Of the Binary Tree
Bottom View Of the Binary Tree (medium)
Solution: Bottom View Of the Binary Tree
Boundary of Binary Tree (medium)
Solution: Boundary of Binary Tree
Introduction to Comparison of Two Trees Pattern
Symmetric Tree (easy)
Solution: Symmetric Tree
Mirror Image Trees (medium)
Solution: Mirror Image Trees
Subtree of Another Tree (easy)
Solution: Subtree of Another Tree
Isomorphic Trees (medium)
Solution: Isomorphic Trees
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST (medium)
Solution: Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree (medium)
Solution: Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions (medium)
Solution: Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree (hard)
Solution: Serialize and Deserialize N-ary Tree
Solution: Maximum Depth of N-ary Tree

Problem Statement

Given a root of the n-ary tree, return the maximum depth of the tree.

The maximum depth refers to the longest path from the root node to any leaf node.

Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value.

Examples

Example 1:

  • Input: root = [1,null,2,3,4,null,5]
Image
  • Expected Output: 3
  • Justification: The path from the root node 1 to the farthest leaf node 5 goes through nodes 1 -> 2 -> 5, making the depth 3.

Example 2:

  • Input: root = [1,null,2,3,4,null,5,null,6,7,8,null,9,10,null,11,12]
Image
  • Expected Output: 4
  • Justification: The longest path from the root node 1 to the farthest leaf node 11 or 12 is 1 -> 2 -> 5 -> 12, resulting in a depth of 4.

Example 3:

  • Input: root = [10,null,20,30,null,40,null,50,null,60]
Image
  • Expected Output: 4
  • Justification: The path from the root node 10 to the farthest leaf node 60 is 10 -> 20 -> 40 -> 60, making the depth 4.

Solution

To solve this problem, we will use a Depth-First Search (DFS) approach. The idea is to explore each node starting from the root and go as deep as possible in each path before backtracking. For every node, we will recursively determine the depth of its children and keep track of the maximum depth encountered. Finally, we add one to account for the current node and return this value. This approach is effective because it ensures that all paths in the tree are explored, allowing us to accurately determine the maximum depth.

Step-by-Step Algorithm

  1. Base case:

    • If the root node is null, return 0 since the tree is empty.
  2. Initialize Depth:

    • Initialize a variable maxDepth to 0. This variable will store the maximum depth found so far.
  3. Iterate Over Children:

    • If the root node has children, loop through each child node in the root.children list.
  4. Recursive Depth Calculation:

    • For each child node, recursively call the findmaxDepth method.
    • Capture the returned depth and update maxDepth with the maximum value between the current maxDepth and the returned depth.
  5. Return Depth:

    • After looping through all children, add 1 to the maxDepth to account for the current node and return this value.

Algorithm Walkthrough

Input: root = [1, null, 2, 3, 4, null, 5]

  1. Initialization:

    • maxDepth is initialized to 0.
  2. Iterate Over Children of Node 1:

    • The method iterates over the children of Node 1 which are Node 2, Node 3, and Node 4.
  3. Recursive Call on Node 2:

    • The method is called recursively with root = Node 2.
    • maxDepth is initialized to 0 for Node 2.
  4. Iterate Over Children of Node 2:

    • The method iterates over the children of Node 2 which is Node 5.
  5. Recursive Call on Node 5:

    • The method is called recursively with root = Node 5.
    • Since Node 5 has no children, the method returns 1 (maxDepth + 1).
  6. Return Depth for Node 2:

    • The method backtracks to Node 2 and updates maxDepth to 1 (the returned depth from Node 5).
    • Adds 1 to maxDepth and returns 2 for Node 2.
  7. Recursive Call on Node 3:

    • The method is called recursively with root = Node 3.
    • Since Node 3 has no children, the method returns 1 (maxDepth + 1).
  8. Recursive Call on Node 4:

    • The method is called recursively with root = Node 4.
    • Since Node 4 has no children, the method returns 1 (maxDepth + 1).
  9. Return Depth for Root (Node 1):

    • The method backtracks to Node 1 and updates maxDepth to 2 (maximum of the depths from Node 2, Node 3, and Node 4).
    • Adds 1 to maxDepth and returns 3 for Node 1.
  10. Final Output:

    • The final output is 3, representing the maximum depth of the tree.

Code

Java

. . . .

Complexity Analysis

Time Complexity

The time complexity of the algorithm is , where N is the number of nodes in the tree. This is because the algorithm performs a Depth-First Search (DFS) on the tree, visiting each node exactly once.

Space Complexity

The space complexity of the algorithm is , where H is the height of the tree. This space is used by the call stack during the recursive depth-first traversal. In the worst case, the height of the tree could be equal to the number of nodes in the tree (e.g., in a skewed tree), making the space complexity .

Maximum Depth of N-ary Tree (easy)
Find maximum depth of subtree (medium)
Mark as Completed

On this page

Problem Statement

Examples

Solution

Step-by-Step Algorithm

Algorithm Walkthrough

Code

Complexity Analysis

Time Complexity

Space Complexity